- normal-order evaluation
- Программирование: нормальный порядок вычислений
Универсальный англо-русский словарь. Академик.ру. 2011.
normal-order evaluation
Смотреть что такое "normal-order evaluation" в других словарях:
Normal order (disambiguation) — Normal order may refer to: Normal order of creation and annihilation operators in theoretical physics Normal order evaluation in computer science Normal order of an arithmetic function in number theory This disambiguation page lists articles… … Wikipedia
Normal Order Reduction — Die Normal Order Reduction (NOR) ist eine Ableitungsstrategie beim Lambda Kalkül, um einen Lambda Ausdruck zu dessen Normalform abzuleiten. Bei dieser Strategie wird die lazy evaluation genutzt, bei der die Ausdrücke erst ausgewertet werden, wenn … Deutsch Wikipedia
Evaluation strategy — Evaluation strategies Strict evaluation Applicative order Call by value Call by reference Call by sharing Call by copy restore Non strict evaluation Normal order Call by name Call by need/Lazy evaluation … Wikipedia
Fold (higher-order function) — In functional programming, fold, also known variously as reduce, accumulate, compress or inject, is a family of higher order functions that process a data structure in some order and build up a return value. Typically, a fold deals with two… … Wikipedia
Lazy evaluation — In computer programming, lazy evaluation (or delayed evaluation) is the technique of delaying a computation until such time as the result of the computation is known to be needed.The actions of lazy evaluation include: performance increases due… … Wikipedia
Normal pressure hydrocephalus — Classification and external resources ICD 10 G91.2 ICD 9 331.9 … Wikipedia
Short-circuit evaluation — Evaluation strategies Strict evaluation Applicative order Call by value Call by reference Call by sharing Call by copy restore Non strict evaluation Normal order Call by name Call by need/Lazy evaluation Call by … Wikipedia
Order of operations — In mathematics and computer programming, the order of operations (sometimes called operator precedence) is a rule used to clarify unambiguously which procedures should be performed first in a given mathematical expression. For example, in… … Wikipedia
Beta normal form — In the lambda calculus, a term is in beta normal form if no beta reduction is possible. A term is in beta eta normal form if neither a beta reduction nor an eta reduction is possible. A term is in head normal form if there is no beta redex in… … Wikipedia
Skolem normal form — A formula of first order logic is in Skolem normal form (named after Thoralf Skolem) if it is in conjunctive prenex normal form with only universal first order quantifiers. Every first order formula can be converted into Skolem normal form while… … Wikipedia
First-order logic — is a formal logical system used in mathematics, philosophy, linguistics, and computer science. It goes by many names, including: first order predicate calculus, the lower predicate calculus, quantification theory, and predicate logic (a less… … Wikipedia
